An Example of ∏03-complete Infinitary Rational Relation
نویسنده
چکیده
We give in this paper an example of infinitary rational relation, accepted by a 2-tape Büchi automaton, which is Π 3 -complete in the Borel hierarchy. Moreover the example of infinitary rational relation given in this paper has a very simple structure and can be easily described by its sections.
منابع مشابه
An Example of Pi^0_3-complete Infinitary Rational Relation
We give in this paper an example of infinitary rational relation, accepted by a 2-tape Büchi automaton, which is Π 3 -complete in the Borel hierarchy. Moreover the example of infinitary rational relation given in this paper has a very simple structure and can be easily described by its sections.
متن کاملTopological and Arithmetical Properties of Infinitary Rational Relations
We prove that there exist some infinitary rational relations which are analytic but non Borel sets, giving an answer to a question of Simonnet [Sim92]. Then we show that for every countable ordinal α one cannot decide whether a given infinitary rational relation is in the Borel class Σα ( respectively Π 0 α). Furthermore one cannot decide whether a given infinitary rational relation is a Borel ...
متن کاملUndecidability of Topological and Arithmetical Properties of Infinitary Rational Relations
We prove that for every countable ordinal α one cannot decide whether a given infinitary rational relation is in the Borel class Σα (respectively Π 0 α). Furthermore one cannot decide whether a given infinitary rational relation is a Borel set or a Σ1-complete set. We prove some recursive analogues to these properties. In particular one cannot decide whether an infinitary rational relation is a...
متن کاملOn Infinite Real Trace Rational Languages of Maximum Topological Complexity
We consider the set Rω(Γ, D) of infinite real traces, over a dependence alphabet (Γ, D) with no isolated letter, equipped with the topology induced by the prefix metric. We then prove that all rational languages of infinite real traces are analytic sets. We reprove also that there exist some rational languages of infinite real traces which are analytic but non Borel sets, and even Σ11-complete,...
متن کاملSome problems in automata theory which depend on the models of set theory
We prove that some fairly basic questions on automata reading infinite words depend on the models of the axiomatic system ZFC. It is known that there are only three possibilities for the cardinality of the complement of an ω-languageL(A) accepted by a Büchi 1-counter automaton A. We prove the following surprising result: there exists a 1-counter Büchi automaton A such that the cardinality of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 15 شماره
صفحات -
تاریخ انتشار 2007